A convenient cryptomorphic version of recursive function theory
نویسندگان
چکیده
منابع مشابه
A foundation for real recursive function theory
The class of recursive functions over the reals, denoted by REC(R), was introduced by Cristopher Moore in his seminal paper written in 1995. Since then many subsequent investigations brought new results: the class REC(R) was put in relation with the class of functions generated by the General Purpose Analogue Computer of Claude Shannon; classical digital computation was embedded in several ways...
متن کاملA Lemma Driven Automatic Theorem Prover for Recursive Function Theory
We d e s c r i b e work in p r o g r e s s on an a u t o m a t i c theo rem p r o v e r f o r r e c u r s i v e f u n c t i o n t h e o r y t h a t w e i n t e n d t o a p p l y i n t h e a n a l y s i s ( i n c l u d i n g v e r i f i c a t i o n and t r a n s f o r m a t i o n ) o f u s e f u l computer p r o g r a m s . The m a t h e m a t i c a l t h e o r y o f ou r theorem p r o v e r i s...
متن کاملRecursive Version of LU Decomposition
The effective use of the cache memories of the processors is a key component of obtaining high performance algorithms and codes, including here algorithms and codes for parallel computers with shared and distributed memories. The recursive algorithms seem to be a tool for such an action. Unfortunately, worldwide used programming language FORTRAN 77 does not allow explicit recursion. The paper p...
متن کاملThe "paradox" of computability and a recursive relative version of the Busy Beaver function
In this article, we will show that uncomputability is a relative property not only of oracle Turing machines, but also of subrecursive classes. We will define the concept of a Turing submachine, and a recursive relative version for the Busy Beaver function which we will call Busy Beaver Plus function. Therefore, we will prove that the computable Busy Beaver Plus function defined on any Turing s...
متن کاملCryptomorphic Programming: A Random Program Concept
We provide a theoretical notion of white-box security for protecting the integrity and privacy of mobile programs. We assume that protecting the program’s semantic privacy will improve the integrity protection of a program, thereby improving tamper resistance and the protection of secret algorithms. We introduce this notion using a Random Oracle Model and describe our important concept of a ran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1975
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(75)90127-8